42 research outputs found
Equation with residuated functions
summary:The structure of solution-sets for the equation is discussed, where are given residuated functions mapping between partially-ordered sets. An algorithm is proposed which produces a solution in the event of finite termination: this solution is maximal relative to initial trial values of . Properties are defined which are sufficient for finite termination. The particular case of max-based linear algebra is discussed, with application to the synchronisation problem for discrete-event systems; here, if data are rational, finite termination is assured. Numerical examples are given. For more general residuated real functions, lower semicontinuity is sufficient for convergence to a solution, if one exists
Complete solution of a constrained tropical optimization problem with application to location analysis
We present a multidimensional optimization problem that is formulated and
solved in the tropical mathematics setting. The problem consists of minimizing
a nonlinear objective function defined on vectors over an idempotent semifield
by means of a conjugate transposition operator, subject to constraints in the
form of linear vector inequalities. A complete direct solution to the problem
under fairly general assumptions is given in a compact vector form suitable for
both further analysis and practical implementation. We apply the result to
solve a multidimensional minimax single facility location problem with
Chebyshev distance and with inequality constraints imposed on the feasible
location area.Comment: 20 pages, 3 figure
Cyclic projectors and separation theorems in idempotent convex geometry
Semimodules over idempotent semirings like the max-plus or tropical semiring
have much in common with convex cones. This analogy is particularly apparent in
the case of subsemimodules of the n-fold cartesian product of the max-plus
semiring it is known that one can separate a vector from a closed subsemimodule
that does not contain it. We establish here a more general separation theorem,
which applies to any finite collection of closed semimodules with a trivial
intersection. In order to prove this theorem, we investigate the spectral
properties of certain nonlinear operators called here idempotent cyclic
projectors. These are idempotent analogues of the cyclic nearest-point
projections known in convex analysis. The spectrum of idempotent cyclic
projectors is characterized in terms of a suitable extension of Hilbert's
projective metric. We deduce as a corollary of our main results the idempotent
analogue of Helly's theorem.Comment: 20 pages, 1 figur
Activating Generalized Fuzzy Implications from Galois Connections
This paper deals with the relation between fuzzy implications and Galois connections, trying to raise the awareness that the fuzzy implications are indispensable to generalise Formal Concept Analysis. The concrete goal of the paper is to make evident that Galois connections, which are at the heart of some of the generalizations of Formal Concept Analysis, can be interpreted as fuzzy incidents. Thus knowledge processing, discovery, exploration and visualization as well as data mining are new research areas for fuzzy implications as they are areas where Formal Concept Analysis has a niche.F.J. Valverde-Albacete—was partially supported by EU FP7 project LiMoSINe, (contract 288024). C. Peláez-Moreno—was partially supported by the Spanish Government-CICYT project 2011-268007/TEC.Publicad
Detecting Features from Confusion Matrices using Generalized Formal Concept Analysis
We claim that the confusion matrices of multiclass problems can be analyzed by means of a generalization of Formal Concept Analysis to obtain symbolic information about the feature sets of the underlying classification task.We prove our claims by analyzing the confusion matrices of human speech perception experiments and comparing our results to those elicited by experts.This work has been supported by Spanish Government-Comisión Interministerial de Ciencia y Tecnología TEC2008-02473/TEC y TEC2008-06382/TEC.Publicad
The level set method for the two-sided eigenproblem
We consider the max-plus analogue of the eigenproblem for matrix pencils
Ax=lambda Bx. We show that the spectrum of (A,B) (i.e., the set of possible
values of lambda), which is a finite union of intervals, can be computed in
pseudo-polynomial number of operations, by a (pseudo-polynomial) number of
calls to an oracle that computes the value of a mean payoff game. The proof
relies on the introduction of a spectral function, which we interpret in terms
of the least Chebyshev distance between Ax and lambda Bx. The spectrum is
obtained as the zero level set of this function.Comment: 34 pages, 4 figures. Changes with respect to the previous version: we
explain relation to mean-payoff games and discrete event systems, and show
that the reconstruction of spectrum is pseudopolynomia
Dynamic analysis of repetitive decision-free discreteevent processes: The algebra of timed marked graphs and algorithmic issues
A model to analyze certain classes of discrete event dynamic systems is presented. Previous research on timed marked graphs is reviewed and extended. This model is useful to analyze asynchronous and repetitive production processes. In particular, applications to certain classes of flexible manufacturing systems are provided in a companion paper. Here, an algebraic representation of timed marked graphs in terms of reccurrence equations is provided. These equations are linear in a nonconventional algebra, that is described. Also, an algorithm to properly characterize the periodic behavior of repetitive production processes is descrbed. This model extends the concepts from PERT/CPM analysis to repetitive production processes.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/44155/1/10479_2005_Article_BF02248590.pd
Synthesizing Systems with Optimal Average-Case Behavior for Ratio Objectives
We show how to automatically construct a system that satisfies a given
logical specification and has an optimal average behavior with respect to a
specification with ratio costs.
When synthesizing a system from a logical specification, it is often the case
that several different systems satisfy the specification. In this case, it is
usually not easy for the user to state formally which system she prefers. Prior
work proposed to rank the correct systems by adding a quantitative aspect to
the specification. A desired preference relation can be expressed with (i) a
quantitative language, which is a function assigning a value to every possible
behavior of a system, and (ii) an environment model defining the desired
optimization criteria of the system, e.g., worst-case or average-case optimal.
In this paper, we show how to synthesize a system that is optimal for (i) a
quantitative language given by an automaton with a ratio cost function, and
(ii) an environment model given by a labeled Markov decision process. The
objective of the system is to minimize the expected (ratio) costs. The solution
is based on a reduction to Markov Decision Processes with ratio cost functions
which do not require that the costs in the denominator are strictly positive.
We find an optimal strategy for these using a fractional linear program.Comment: In Proceedings iWIGP 2011, arXiv:1102.374